Synchronization Strings: Channel Simulations and Interactive Coding for Insertions and Deletions
نویسندگان
چکیده
We present many new results related to reliable (interactive) communication over insertiondeletion channels. Synchronization errors, such as insertions and deletions, strictly generalize the usual symbol corruption errors and are much harder to protect against. We show how to hide the complications of synchronization errors in many applications by introducing very general channel simulations which efficiently transform an insertion-deletion channel into a regular symbol corruption channel with an error rate larger by a constant factor and a slightly smaller alphabet. We utilize and generalize synchronization string based methods which were recently introduced as a tool to design essentially optimal error correcting codes for insertion-deletion channels. Our channel simulations depend on the fact that, at the cost of increasing the error rate by a constant factor, synchronization strings can be decoded in a streaming manner that preserves linearity of time. We also provide a lower bound showing that this constant factor cannot be improved to 1 + ε, in contrast to what is achievable for error correcting codes. Our channel simulations drastically and cleanly generalize the applicability of synchronization strings. We provide new interactive coding schemes which simulate any interactive two-party protocol over an insertion-deletion channel. Our results improve over the interactive coding scheme of Braverman et al. [8] which achieves a small constant rate and requires exponential time computations. We provide the first computationally efficient interactive coding schemes for synchronization errors, the first coding scheme with a rate approaching one for small noise rates, and also improve over the maximal tolerable error rate. We also show tight connections between synchronization strings and edit-distance tree codes which allow us to transfer results from tree codes directly to edit-distance tree codes. ∗Authors’ addresses: {haeupler,shahrasbi,vitercik}@cs.cmu.edu. ar X iv :1 70 7. 04 23 3v 1 [ cs .I T ] 1 3 Ju l 2 01 7
منابع مشابه
Synchronization Strings: Explicit Constructions, Local Decoding, and Applications
This paper gives new results for synchronization strings, a powerful combinatorial object that allows to efficiently deal with insertions and deletions in various communication problems: • We give a deterministic, linear time synchronization string construction, improving over an O(n) time randomized construction. Independently of this work, a deterministic O(n log log n) time construction was ...
متن کاملBounds on the Optimal Rate for Synchronization from Deletions and Insertions
Consider two remotely located binary sourcesX and Y , where Y is mis-synchronized from X due to deletions and insertions. The distribution of X is known, and Y is obtained from X through a process of i.i.d deletions and insertions. What is the minimum rate of information X needs to send in order to synchronize Y to X? This is a distributed source coding problem, so the optimal rate is the condi...
متن کاملString editing under a combination of constraints
Let X and Y be any two strings of finite lengths N and M , respectively, over a finite alphabet. An edit distance between X and Y is defined as the minimum sum of elementary edit distances associated with edit operations of substitutions, deletions, and insertions needed to transform X to Y . In this paper, the problem of efficient computation of such a distance is considered under the assumpti...
متن کاملInvestigation of Polymorphisms in Non-Coding Region of Human Mitochondrial DNA in 31 Iranian Hypertrophic Cardiomyopathy (HCM) Patients
The D-loop region is a hot spot for mitochondrial DNA (mtDNA) alterations, containing two hypervariable segments, HVS-I and HVS-II. In order to identify polymorphic sites and potential genetic background accounting for Hypertrophic CardioMyopathy (HCM) disease, the complete non-coding region of mtDNA from 31 unrelated HCM patients and 45 normal controls were sequenced. The sequences were aligne...
متن کاملSynchronization Strings: List Decoding for Insertions and Deletions
We study codes that are list-decodable under insertions and deletions (“insdel codes”). Specifically, we consider the setting where, given a codeword x of length n over some finite alphabet Σ of size q, δ · n codeword symbols may be adversarially deleted and γ · n symbols may be adversarially inserted to yield a corrupted word w. A code is said to be list-decodable if there is an (efficient) al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1707.04233 شماره
صفحات -
تاریخ انتشار 2017